Color, consciousness, and the isomorphism constraint.
نویسنده
چکیده
The relations among consciousness, brain behavior, and scientific explanation are explored in the domain of color perception. Current scientific knowledge about color similarity, color composition, dimensional structure, unique colors, and color categories is used to assess Locke's "inverted spectrum argument" about the undetectability of color transformations. A symmetry analysis of color space shows that the literal interpretation of this argument--reversing the experience of a rainbow--would not work. Three other color to color transformations might work, however, depending on the relevance of certain color categories. The approach is then generalized to examine behavioral detection of arbitrary differences in color experiences, leading to the formulation of a principled distinction, called the "isomorphism constraint," between what can and cannot be determined about the nature of color experience by objective behavioral means. Finally, the prospects for achieving a biologically based explanation of color experience below the level of isomorphism are considered in light of the limitations of behavioral methods. Within-subject designs using biological interventions hold the greatest promise for scientific progress on consciousness, but objective knowledge of another person's experience appears impossible. The implications of these arguments for functionalism are discussed.
منابع مشابه
Lower Bounds for Heuristic Algorithms
The constraint satisfaction problem, the Boolean satisfiability problem and the graph isomorphism problem do not have efficient algorithms. In order to solve these problems, one utilizes heuristic algorithms of polynomial running time. The present thesis studies three classical heuristics for the above-mentioned decision problems and answers the question whether they can be implemented more eff...
متن کامل[this Is a Comment on a Ms. by Stephen E. Palmer, Entitled Color, Consciousness and the Isomorphism Constraint, to Appear in Behavioral and Brain Sciences.]
PURPLE (RED-and-BLUE) is the most frequently occurring derived (binary) basic color term (BCT), but there is never a named composite BCT meaning RED-or-BLUE. GREEN-or-BLUE is the most frequently named composite color category, but there is never a BCT for the corresponding derived (binary) category CYAN (BLUE-and-GREEN). Why? Palmer notes that the naming of some but not all of the possible comp...
متن کاملOn the Group and Color Isomorphism Problems
In this paper, we prove results on the relationship between the complexity of the group and color isomorphism problems. The difficulty of color isomorphism problems is known to be closely linked to the the composition factors of the permutation group involved. Previous works are primarily concerned with applying color isomorphism to bounded degree graph isomorphism, and have therefore focused o...
متن کاملThe Complexity of Boolean Constraint Isomorphism
We consider the Boolean constraint isomorphism problem, that is, the problem of determining whether two sets of Boolean constraint applications can be made equivalent by renaming the variables. We show that depending on the set of allowed constraints, the problem is either coNP-hard and GI-hard, equivalent to graph isomorphism, or polynomial-time solvable. This establishes a complete classifica...
متن کاملOn Hypergraph and Graph Isomorphism with Bounded Color Classes
Using logspace counting classes we study the computational complexity of hypergraph and graph isomorphism where the vertex sets have bounded color classes for certain specific bounds. We also give a polynomial-time algorithm for hypergraph isomorphism for bounded color classes of arbitrary size.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- The Behavioral and brain sciences
دوره 22 6 شماره
صفحات -
تاریخ انتشار 1999